Tseitin's formulas revisited

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Query learning of Horn formulas revisited

We discuss a number of (mostly open) questions related to the learnability of Horn clauses from queries. We consider that the currently existing solution is satisfactory only to a certain extent, and that progress on the related questions stated here could contribute positively to advancing the state of the art in several related fields. Our contributions here are a new analysis of the existing...

متن کامل

Relation Formulas for Protoalgebraic Equality Free Quasivarieties; Pałasińska's Theorem Revisited

We provide a new proof of the following Pa lasińska’s theorem: Every finitely generated protoalgebraic relation distributive equality free quasivariety is finitely axiomatizable. The main tool we use are Q-relation formulas, for a protoalgebraic equality free quasivariety Q, which are the counterparts of the congruence formulas used for describing the generation of congruences in algebras. Havi...

متن کامل

QUICKSELECT Revisited

We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.

متن کامل

PENDRED\'S SYNDROME REVISITED

Pendred's syndrome is defined as a triad of congenital perceptive hearing loss, goiter, and abnormal perchlorate test. Three brothers with Pendred's syndrome [P.S.] are reported. The oldest brother has hearing loss (he has been deaf and mute since childhood) and has a large goiter. A thyroid scan revealed euthyroid multinodular goiter and a perchlorate test was performed, and reported abno...

متن کامل

Linear Formulas in Continuous Logic

We prove that continuous sentences preserved by the ultramean construction (a generalization of the ultraproduct construction) are exactly those sentences which are approximated by linear sentences. Continuous sentences preserved by linear elementary equivalence are exactly those sentences which are approximated in the Riesz space generated by linear sentences. Also, characterizations for linea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1992

ISSN: 0304-3975

DOI: 10.1016/0304-3975(92)90356-k